The call-by-value -calculus: a semantic investigation
نویسندگان
چکیده
In this work we present a categorical approach for modeling the pure (i.e., without constants) call-by-value -calculus, defined by Plotkin as a restriction of the classical one. In particular, we study the properties a category must enjoy for give rise to a model of such a language. This definition is enough general for grasping models in different settings.
منابع مشابه
Standardization of a Call-By-Value Lambda-Calculus
We study an extension of Plotkin’s call-by-value lambda-calculus by means of two commutation rules (sigma-reductions). Recently, it has been proved that this extended calculus provides elegant characterizations of many semantic properties, as for example solvability. We prove a standardization theorem for this calculus by generalizing Takahashi’s approach of parallel reductions. The standardiza...
متن کاملDuality of computation and sequent calculus: a few more remarks
A succession of works have contributed to the understanding of the computational content of Gentzen-style classical sequent calculus. Especially, it has been shown that the left-right duality of sequent calculus expresses a syntactic duality between programs and their evaluation contexts and that sequent calculus has two dual syntactic restrictions that respectively correspond to callby-name ev...
متن کاملStandardization and Conservativity of a Refined Call-by-Value lambda-Calculus
We study an extension of Plotkin’s call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant characterizations of many semantic properties. We prove that this extended calculus is a conservative refinement of Plotkin’s one. In particular, the notions...
متن کاملA Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus
Step-indexed semantic models of types were proposed as an alternative to purely syntactic safety proofs using subject-reduction. Building upon the work by Appel and others, we introduce a generalized step-indexed model for the call-by-name lambda calculus. We also show how to prove type safety of general recursion in our call-by-name model.
متن کاملOperational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
Plotkin has advocated the combination of linear lambda calculus, polymorphism and fixed point recursion as an expressive semantic metalanguage. We study its expressive power from an operational point of view. We show that the naturally call-by-value operators of linear lambda calculus can be given a call-by-name semantics without affecting termination at exponential types and hence without affe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007